|
|
Collision detection in 3D space
Grulich, Jan ; Matoušek, Radomil (referee) ; Lang, Stanislav (advisor)
Práce se zabývá detekcí kolizí v 3D simulačním prostoru. V první části jsou popsány nejpoužívanější algoritmy pro detekci, stejně jako některé knihovny hotových řešení. Druhá část práce obsahuje popis testovacího softwaru vytvořeného na základě knihovny OpenGL, včetně popisu důležitých částí. V poslední části práce jsou také prezentovány výsledky testování a porovnání vybraných algoritmů na vytvořených testovacích úlohách.
|
|
|
Gamut mapping algorithms in color management
Svoboda, Jan ; Říha, Kamil (referee) ; Rajmic, Pavel (advisor)
The thesis deals with colors - their representation in digital devices and how to provide the best color preservation accross different devices. In the first part of the work, the knowledge of colors and human vision is briefly summarized. Then color models and color spaces are elaborated, mainly those device independent. Spectrum of colors viewable or printable on a device - the gamut - is different for every device and there's a need of precise reproduction or record of color. That's why the system of color management is described further and especially the gamut mapping approaches and algorithms are mentioned. In the second part of the work, the implementation of how two algorithms of color gamut mapping (HPMINDE, SCLIP) can be implemented in MATLAB is described. In the third and last part of the work, the results of implemented algorithms are presented and discussed. These results are compared to results of commonly used color gamut mapping technique (Adobe Photoshop).
|
|
|
Quantitative weak compactness
Rolínek, Michal ; Spurný, Jiří (advisor) ; Kalenda, Ondřej (referee)
In this thesis we study quantitative weak compactness in spaces (C(K), τp) and later in Banach spaces. In the first chapter we introduce several quantities, which in different manners measure τp-noncompactness of a given uniformly bounded set H ⊂ RK . We apply the results in Banach spaces in chapter 2, where we prove (among others) a quantitative version of the Eberlein-Smulyan theorem. In the third chapter we focus on convex closures and how they affect measures of noncompactness. We prove a quantitative version of the Krein-Smulyan theorem. The first three chapters show that measuring noncompactness is intimately related to measuring distances from function spaces. We follow this idea in chapters 4 and 5, where we measure distances from Baire one functions first in RK and later also in Banach spaces. 1
|
|
|
Extremal Polyominoes
Steffanová, Veronika ; Valtr, Pavel (advisor) ; Cibulka, Josef (referee)
Title: Extremal Polyominoes Author: Veronika Steffanová Department: Department of Applied Mathematics Supervisor: Doc. RNDr. Pavel Valtr, Dr. Abstract: The thesis is focused on polyominoes and other planar figures consisting of regular polygons, namely polyiamonds and polyhexes. We study the basic geometrical properties: the perimeter, the convex hull and the bounding rectangle/hexagon. We maximise and minimise these parameters and for the fixed size of the polyomino, denoted by n. We compute the extremal values of a chosen parameter and then we try to enumerate all polyominoes of the size n, which has the extremal property. Some of the problems were solved by other authors. We summarise their results. Some of the problems were solved by us, namely the maximal bounding rectan- gle/hexagon and maximal convex hull of polyiamonds. There are still sev- eral topics which remain open. We summarise the literature and offer our observations for the following scientists. Keywords: Polyomino, convex hull, extremal questions, plane 1
|
|
|
Quantitative weak compactness
Rolínek, Michal ; Spurný, Jiří (advisor) ; Kalenda, Ondřej (referee)
In this thesis we study quantitative weak compactness in spaces (C(K), τp) and later in Banach spaces. In the first chapter we introduce several quantities, which in different manners measure τp-noncompactness of a given uniformly bounded set H ⊂ RK . We apply the results in Banach spaces in chapter 2, where we prove (among others) a quantitative version of the Eberlein-Smulyan theorem. In the third chapter we focus on convex closures and how they affect measures of noncompactness. We prove a quantitative version of the Krein-Smulyan theorem. The first three chapters show that measuring noncompactness is intimately related to measuring distances from function spaces. We follow this idea in chapters 4 and 5, where we measure distances from Baire one functions first in RK and later also in Banach spaces. 1
|
|
|
Collision detection in 3D space
Grulich, Jan ; Matoušek, Radomil (referee) ; Lang, Stanislav (advisor)
Práce se zabývá detekcí kolizí v 3D simulačním prostoru. V první části jsou popsány nejpoužívanější algoritmy pro detekci, stejně jako některé knihovny hotových řešení. Druhá část práce obsahuje popis testovacího softwaru vytvořeného na základě knihovny OpenGL, včetně popisu důležitých částí. V poslední části práce jsou také prezentovány výsledky testování a porovnání vybraných algoritmů na vytvořených testovacích úlohách.
|
|
|
Gamut mapping algorithms in color management
Svoboda, Jan ; Říha, Kamil (referee) ; Rajmic, Pavel (advisor)
The thesis deals with colors - their representation in digital devices and how to provide the best color preservation accross different devices. In the first part of the work, the knowledge of colors and human vision is briefly summarized. Then color models and color spaces are elaborated, mainly those device independent. Spectrum of colors viewable or printable on a device - the gamut - is different for every device and there's a need of precise reproduction or record of color. That's why the system of color management is described further and especially the gamut mapping approaches and algorithms are mentioned. In the second part of the work, the implementation of how two algorithms of color gamut mapping (HPMINDE, SCLIP) can be implemented in MATLAB is described. In the third and last part of the work, the results of implemented algorithms are presented and discussed. These results are compared to results of commonly used color gamut mapping technique (Adobe Photoshop).
|
guest ::
